On Well-rounded Ideal Lattices - Ii
نویسندگان
چکیده
We study well-rounded lattices which come from ideals in quadratic number fields, generalizing some recent results of the first author with K. Petersen [8]. In particular, we give a characterization of ideal well-rounded lattices in the plane and show that a positive proportion of real and imaginary quadratic number fields contains ideals giving rise to well-rounded lattices.
منابع مشابه
ON WELL - ROUNDED IDEAL LATTICES 3 Theorem 1
We investigate a connection between two important classes of Euclidean lattices: well-rounded and ideal lattices. A lattice of full rank in a Euclidean space is called well-rounded if its set of minimal vectors spans the whole space. We consider lattices coming from full rings of integers in number fields, proving that only cyclotomic fields give rise to well-rounded lattices. We further study ...
متن کاملOn Well-rounded Ideal Lattices
We investigate a connection between two important classes of Euclidean lattices: well-rounded and ideal lattices. A lattice of full rank in a Euclidean space is called well-rounded if its set of minimal vectors spans the whole space. We consider lattices coming from full rings of integers in number fields, proving that only cyclotomic fields give rise to well-rounded lattices. We further study ...
متن کاملOn Integral Well-rounded Lattices in the Plane
We investigate distribution of integral well-rounded lattices in the plane, producing a complete parameterization of the set of their similarity classes by solutions of the family of Pell-type Diophantine equations of the form x2 +Dy2 = z2 where D > 0 is squarefree. We then apply our results to the study of the greatest minimal norm and the highest signal-to-noise ratio on the set of such latti...
متن کاملA New Ring-Based SPHF and PAKE Protocol On Ideal Lattices
emph{ Smooth Projective Hash Functions } ( SPHFs ) as a specific pattern of zero knowledge proof system are fundamental tools to build many efficient cryptographic schemes and protocols. As an application of SPHFs, emph { Password - Based Authenticated Key Exchange } ( PAKE ) protocol is well-studied area in the last few years. In 2009, Katz and Vaikuntanathan described the first lattice-based ...
متن کاملT-Rough Sets Based on the Lattices
The aim of this paper is to introduce and study set- valued homomorphism on lattices and T-rough lattice with respect to a sublattice. This paper deals with T-rough set approach on the lattice theory. The result of this study contributes to, T-rough fuzzy set and approximation theory and proved in several papers. Keywords: approximation space; lattice; prime ideal; rough ideal; T-rough set; set...
متن کامل